Splitting quaternion algebras over quadratic number fields

نویسنده

  • Péter Kutas
چکیده

We propose an algorithm for finding zero divisors in quaternion algebras over quadratic number fields, or equivalently, solving homogeneous quadratic equations in three variables over Q( √ d) where d is a square-free integer. The algorithm is deterministic and runs in polynomial time if one is allowed to call oracles for factoring integers and polynomials over finite fields.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

One class genera of ternary quadratic forms over number fields

We enumerate all one class genera of definite ternary quadratic forms over number fields. For this, we construct all Gorenstein orders of type number one in definite quaternion algebras over number fields. Finally, we list all definite quaternion orders of ideal class number one.

متن کامل

Lattice Point Counting and Height Bounds over Number Fields and Quaternion Algebras

An important problem in analytic and geometric combinatorics is estimating the number of lattice points in a compact convex set in a Euclidean space. Such estimates have numerous applications throughout mathematics. In this note, we exhibit applications of a particular estimate of this sort to several counting problems in number theory: counting integral points and units of bounded height over ...

متن کامل

Algebras and Involutions

• Vectorspaces over division rings • Matrices, opposite rings • Semi-simple modules and rings • Semi-simple algebras • Reduced trace and norm • Other criteria for simplicity • Involutions • Brauer group of a field • Tensor products of fields • Crossed product construction of simple algebras • Cyclic algebra construction of simple algebras • Quaternion algebras • Examples • Unramified extensions...

متن کامل

A Gross-Zagier formula for quaternion algebras over totally real fields

We prove a higher dimensional generalization of Gross and Zagier’s theorem on the factorization of differences of singular moduli. Their result is proved by giving a counting formula for the number of isomorphisms between elliptic curves with complex multiplication by two different imaginary quadratic fields K and K′, when the curves are reduced modulo a supersingular prime and its powers. Equi...

متن کامل

Explicit equivalence of quadratic forms over $\mathbb{F}_q(t)$

We propose a randomized polynomial time algorithm for computing nontrivial zeros of quadratic forms in 4 or more variables over Fq(t), where Fq is a finite field of odd characteristic. The algorithm is based on a suitable splitting of the form into two forms and finding a common value they both represent. We make use of an effective formula on the number of fixed degree irreducible polynomials ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1606.01053  شماره 

صفحات  -

تاریخ انتشار 2016